Cumulative Restricted Boltzmann Machines for Ordinal Matrix Data Analysis
نویسندگان
چکیده
Ordinal data is omnipresent in almost all multiuser-generated feedback questionnaires, preferences etc. This paper investigates modelling of ordinal data with Gaussian restricted Boltzmann machines (RBMs). In particular, we present the model architecture, learning and inference procedures for both vector-variate and matrix-variate ordinal data. We show that our model is able to capture latent opinion profile of citizens around the world, and is competitive against state-of-art collaborative filtering techniques on large-scale public datasets. The model thus has the potential to extend application of RBMs to diverse domains such as recommendation systems, product reviews and expert assessments.
منابع مشابه
Elastic regularization in restricted Boltzmann machines: Dealing with $p\gg N$
Restricted Boltzmann machines (RBMs) are endowed with the universal power of modeling (binary) joint distributions. Meanwhile, as a result of their confining network structure, training RBMs confronts less difficulties (compared with more complicated models, e.g., Boltzmann machines) when dealing with approximation and inference issues. However, in certain computational biology scenarios, such ...
متن کاملSparse Group Restricted Boltzmann Machines
Since learning in Boltzmann machines is typically quite slow, there is a need to restrict connections within hidden layers. However, the resulting states of hidden units exhibit statistical dependencies. Based on this observation, we propose using l1/l2 regularization upon the activation probabilities of hidden units in restricted Boltzmann machines to capture the local dependencies among hidde...
متن کاملMixed-Variate Restricted Boltzmann Machines
Modern datasets are becoming heterogeneous. To this end, we present in this paper MixedVariate Restricted Boltzmann Machines for simultaneously modelling variables of multiple types and modalities, including binary and continuous responses, categorical options, multicategorical choices, ordinal assessment and category-ranked preferences. Dependency among variables is modeled using latent binary...
متن کاملTailoring Boltzmann Machines to Netflix Data
If we let p(f) ∝ e, we obtain a probability distribution over assignments of binary states to the vertices of the machine. Let A(V ) denote the set of assigments of {0, 1} values to V , i.e. A(V ) = {a | a : V → {0, 1}}. A restricted boltzmann machine(RBM), introduced in [Smo86], is a boltzmann machine where the underlying graph is a complete bipartite graph. Let V = V1∪V2 be the partition of t...
متن کاملSparse Boltzmann Machines with Structure Learning as Applied to Text Analysis
We are interested in exploring the possibility and benefits of structure learning for deep models. As the first step, this paper investigates the matter for Restricted Boltzmann Machines (RBMs). We conduct the study with Replicated Softmax, a variant of RBMs for unsupervised text analysis. We present a method for learning what we call Sparse Boltzmann Machines, where each hidden unit is connect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012